github.com/andybalholm/brotli/matchfinder.tableEntry.offset (field)

142 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		bargain1.go#L72: 			v := z.table6[i].offset
		bargain1.go#L77: 				z.table6[i].offset = v
		bargain1.go#L145: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		bargain1.go#L166: 			if int(candidate6.offset) < i && i-int(candidate6.offset) < z.MaxDistance && uint32(cv) == candidate6.val &&
		bargain1.go#L167: 				binary.LittleEndian.Uint32(src[candidate6.offset:]) == uint32(cv) {
		bargain1.go#L168: 				m := extendMatch2(src, i, int(candidate6.offset), historyLen)
		bargain2.go#L74: 			v := z.table5[i].offset
		bargain2.go#L79: 				z.table5[i].offset = v
		bargain2.go#L83: 			v := z.table8[i].offset
		bargain2.go#L88: 				z.table8[i].offset = v
		bargain2.go#L158: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		bargain2.go#L182: 			if int(candidate5.offset) < i && i-int(candidate5.offset) < z.MaxDistance && uint32(cv) == candidate5.val &&
		bargain2.go#L183: 				binary.LittleEndian.Uint32(src[candidate5.offset:]) == uint32(cv) {
		bargain2.go#L184: 				m := extendMatch2(src, i, int(candidate5.offset), historyLen)
		bargain2.go#L198: 			if int(candidate8.offset) < i && i-int(candidate8.offset) < z.MaxDistance && uint32(cv) == candidate8.val &&
		bargain2.go#L199: 				binary.LittleEndian.Uint32(src[candidate8.offset:]) == uint32(cv) {
		bargain2.go#L200: 				m := extendMatch2(src, i, int(candidate8.offset), historyLen)
		bargain3.go#L71: 			v := z.table5[i].offset
		bargain3.go#L76: 				z.table5[i].offset = v
		bargain3.go#L80: 			v := z.table8[i].offset
		bargain3.go#L85: 				z.table8[i].offset = v
		bargain3.go#L89: 			v := z.table12[i].offset
		bargain3.go#L94: 				z.table12[i].offset = v
		bargain3.go#L167: 		entry := tableEntry{offset: int32(i), val: uint32(cv)}
		bargain3.go#L192: 			if int(candidate5.offset) < i && i-int(candidate5.offset) < z.MaxDistance && uint32(cv) == candidate5.val &&
		bargain3.go#L193: 				binary.LittleEndian.Uint32(src[candidate5.offset:]) == uint32(cv) {
		bargain3.go#L194: 				m := extendMatch2(src, i, int(candidate5.offset), historyLen)
		bargain3.go#L208: 			if int(candidate8.offset) < i && i-int(candidate8.offset) < z.MaxDistance && uint32(cv) == candidate8.val &&
		bargain3.go#L209: 				binary.LittleEndian.Uint32(src[candidate8.offset:]) == uint32(cv) {
		bargain3.go#L210: 				m := extendMatch2(src, i, int(candidate8.offset), historyLen)
		bargain3.go#L224: 			if int(candidate12.offset) < i && i-int(candidate12.offset) < z.MaxDistance && uint32(cv) == candidate12.val &&
		bargain3.go#L225: 				binary.LittleEndian.Uint32(src[candidate12.offset:]) == uint32(cv) {
		bargain3.go#L226: 				m := extendMatch2(src, i, int(candidate12.offset), historyLen)
		trio.go#L33: 			v := z.table5[i].offset
		trio.go#L38: 				z.table5[i].offset = v
		trio.go#L42: 			v := z.table8[i].offset
		trio.go#L47: 				z.table8[i].offset = v
		trio.go#L51: 			v := z.table12[i].offset
		trio.go#L56: 				z.table12[i].offset = v
		trio.go#L103: 			entry := tableEntry{offset: s, val: uint32(cv)}
		trio.go#L122: 			if candidate12.offset < s && s-candidate12.offset < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L123: 				binary.LittleEndian.Uint32(src[candidate12.offset:]) == uint32(cv) {
		trio.go#L125: 				t = candidate12.offset
		trio.go#L129: 			if candidate8.offset < s && s-candidate8.offset < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&
		trio.go#L130: 				binary.LittleEndian.Uint32(src[candidate8.offset:]) == uint32(cv) {
		trio.go#L131: 				t = candidate8.offset
		trio.go#L135: 			if candidate5.offset < s && s-candidate5.offset < int32(z.MaxDistance) && uint32(cv) == candidate5.val &&
		trio.go#L136: 				binary.LittleEndian.Uint32(src[candidate5.offset:]) == uint32(cv) {
		trio.go#L137: 				t = candidate5.offset
		trio.go#L158: 			coffset12 := s - candidate12.offset + 1
		trio.go#L159: 			coffset8 := s - candidate8.offset + 1
		trio.go#L160: 			entry := tableEntry{offset: s + 1, val: uint32(cv)}
		trio.go#L163: 			if candidate12.offset < s+1 && coffset12 < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L164: 				binary.LittleEndian.Uint32(src[candidate12.offset:]) == uint32(cv) {
		trio.go#L165: 				t = candidate12.offset
		trio.go#L167: 			} else if hashLengthFound < 8 && candidate8.offset < s+1 && coffset8 < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&
		trio.go#L168: 				binary.LittleEndian.Uint32(src[candidate8.offset:]) == uint32(cv) {
		trio.go#L169: 				t = candidate8.offset
		trio.go#L192: 				te0 := tableEntry{offset: index0, val: uint32(cv0)}
		trio.go#L208: 			entry := tableEntry{offset: s, val: uint32(cv)}
		trio.go#L214: 			if candidate12.offset < s && s-candidate12.offset < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L215: 				binary.LittleEndian.Uint32(src[candidate12.offset:]) == uint32(cv) {
		trio.go#L217: 				t = candidate12.offset
		trio.go#L218: 			} else if candidate8.offset < s && s-candidate8.offset < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&
		trio.go#L219: 				binary.LittleEndian.Uint32(src[candidate8.offset:]) == uint32(cv) {
		trio.go#L221: 				t = candidate8.offset
		trio.go#L285: 			te0 := tableEntry{offset: index0, val: uint32(cv0)}
		zdfast.go#L41: 			v := z.table[i].offset
		zdfast.go#L47: 			z.table[i].offset = v
		zdfast.go#L50: 			v := z.longTable[i].offset
		zdfast.go#L56: 			z.longTable[i].offset = v
		zdfast.go#L106: 			entry := tableEntry{offset: s + z.current, val: uint32(cv)}
		zdfast.go#L133: 			coffsetL := s - (candidateL.offset - z.current)
		zdfast.go#L134: 			coffsetS := s - (candidateS.offset - z.current)
		zdfast.go#L136: 				t = candidateL.offset - z.current
		zdfast.go#L143: 				t = candidateS.offset - z.current
		zdfast.go#L152: 				coffsetL = s - (candidateL.offset - z.current) + 1
		zdfast.go#L153: 				z.longTable[nextHashL] = tableEntry{offset: s + 1 + z.current, val: uint32(cv)}
		zdfast.go#L155: 					t = candidateL.offset - z.current
		zdfast.go#L164: 				t = candidateS.offset - z.current
		zdfast.go#L204: 		te0 := tableEntry{offset: index0 + z.current, val: uint32(cv0)}
		zdfast.go#L205: 		te1 := tableEntry{offset: index1 + z.current, val: uint32(cv1)}
		zdfast.go#L210: 		te0.offset++
		zdfast.go#L211: 		te1.offset++
		zdfast.go#L226: 			entry := tableEntry{offset: s + z.current, val: uint32(cv)}
		zfast.go#L10: 	offset int32
		zfast.go#L47: 			v := z.table[i].offset
		zfast.go#L53: 			z.table[i].offset = v
		zfast.go#L102: 			z.table[nextHash] = tableEntry{offset: s + z.current, val: uint32(cv)}
		zfast.go#L103: 			z.table[nextHash2] = tableEntry{offset: s + z.current + 1, val: uint32(cv >> 8)}
		zfast.go#L127: 			coffset0 := s - (candidate.offset - z.current)
		zfast.go#L128: 			coffset1 := s - (candidate2.offset - z.current) + 1
		zfast.go#L130: 				t = candidate.offset - z.current
		zfast.go#L137: 				t = candidate2.offset - z.current
		zfast.go#L180: 			z.table[nextHash] = tableEntry{offset: s + z.current, val: uint32(cv)}
		zm.go#L38: 			v := z.table[i].offset
		zm.go#L43: 				z.table[i].offset = v
		zm.go#L47: 			v := z.longTable[i].offset
		zm.go#L52: 				z.longTable[i].offset = v
		zm.go#L95: 			entry := tableEntry{offset: s, val: uint32(cv)}
		zm.go#L113: 			if candidateL.offset < s && s-candidateL.offset < int32(z.MaxDistance) && uint32(cv) == candidateL.val &&
		zm.go#L114: 				binary.LittleEndian.Uint32(src[candidateL.offset:]) == uint32(cv) {
		zm.go#L116: 				t = candidateL.offset
		zm.go#L119: 			if candidateS.offset < s && s-candidateS.offset < int32(z.MaxDistance) && uint32(cv) == candidateS.val &&
		zm.go#L120: 				binary.LittleEndian.Uint32(src[candidateS.offset:]) == uint32(cv) {
		zm.go#L126: 				coffsetL := s - candidateL.offset + 1
		zm.go#L127: 				z.longTable[nextHashL] = tableEntry{offset: s + 1, val: uint32(cv)}
		zm.go#L128: 				if candidateL.offset < s+1 && coffsetL < int32(z.MaxDistance) && uint32(cv) == candidateL.val &&
		zm.go#L129: 					binary.LittleEndian.Uint32(src[candidateL.offset:]) == uint32(cv) {
		zm.go#L132: 					t = candidateL.offset
		zm.go#L137: 				t = candidateS.offset
		zm.go#L154: 		te0 := tableEntry{offset: index0, val: uint32(cv0)}
		zm.go#L157: 		te0.offset++
		zm.go#L176: 			entry := tableEntry{offset: s, val: uint32(cv)}
		zm.go#L181: 			if candidateL.offset < s && s-candidateL.offset < int32(z.MaxDistance) && uint32(cv) == candidateL.val &&
		zm.go#L182: 				binary.LittleEndian.Uint32(src[candidateL.offset:]) == uint32(cv) {
		zm.go#L184: 				t = candidateL.offset
		zm.go#L185: 			} else if candidateS.offset < s && s-candidateS.offset < int32(z.MaxDistance) && uint32(cv) == candidateS.val &&
		zm.go#L186: 				binary.LittleEndian.Uint32(src[candidateS.offset:]) == uint32(cv) {
		zm.go#L188: 				t = candidateS.offset
		zm.go#L193: 				coffsetL := s - candidateL.offset + 1
		zm.go#L194: 				z.longTable[nextHashL] = tableEntry{offset: s + 1, val: uint32(cv)}
		zm.go#L195: 				if candidateL.offset < s+1 && coffsetL < int32(z.MaxDistance) && uint32(cv) == candidateL.val &&
		zm.go#L196: 					binary.LittleEndian.Uint32(src[candidateL.offset:]) == uint32(cv) {
		zm.go#L199: 					t = candidateL.offset
		zm.go#L263: 			te1 := tableEntry{offset: index1, val: uint32(cv1)}
		zm.go#L266: 			te1.offset++